import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

/**
 * @author CoderXshuai
 * @date 2021/8/31 14:34
 */
public class HighestPriceinSupplyChain {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        //dfs或者bfs，可以考虑dp
        String[] s = reader.readLine().split(" ");
        int n = Integer.parseInt(s[0]);
        double base = Double.parseDouble(s[1]);
        double rate = Double.parseDouble(s[2]) / 100;
        s = reader.readLine().split(" ");
        Map<Integer, Node> total = new HashMap<>((int) (n / 0.75) + 1);
        int count = 0;
        int pre = 0;
        for (int i = 0; i < n; i++) {
            int parseInt = Integer.parseInt(s[i]);
            Node cur = new Node(i, null);
            if (!total.containsKey(parseInt)) {
                List<Node> list = new ArrayList<>();
                list.add(cur);
                total.put(parseInt, new Node(parseInt, list));
            } else {
                total.get(parseInt).next.add(cur);
            }
        }
        Queue<Node> q = new LinkedList<>();
        q.offer(total.get(-1));
        int step = 0;
        while (!q.isEmpty()) {
            int sz = q.size();
            for (int i = 0; i < sz; i++) {
                Node cur = q.poll();
                for (Node node : cur.next) {
                    node = total.getOrDefault(node.index, null);
                    count++;
                    if (node != null)
                        q.offer(node);
                }
            }
            step++;
            pre = count;
            count = 0;
        }

        System.out.printf("%.2f", base * Math.pow(1.00 + rate, step - 1));
        System.out.print(" " + pre);
        reader.close();
    }

    static class Node {
        int index;
        List<Node> next;

        public Node(int index, List<Node> next) {
            this.index = index;
            this.next = next;
        }
    }
}
